Monadic Fragments of Intuitionistic Control Logic
نویسنده
چکیده
We investigate monadic fragments of Intuitionistic Control Logic (ICL), which is obtained from Intuitionistic Propositional Logic (IPL) by extending language of IPL by a constant distinct from intuitionistic constants. In particular we present the complete description of purely negational fragment and show that most of monadic fragments are finite.
منابع مشابه
Negational Fragment of Intuitionistic Control Logic
We investigate properties of monadic purely negational fragment of Intuitionistic Control Logic (ICL). This logic arises from Intuitionistic Propositional Logic (IPL) by extending language of IPL by additional new constant for falsum. Having two different falsum constants enables to define two forms of negation. We analyse implicational relations between negational monadic formulae and present ...
متن کاملUndecidability of first-order intuitionistic and modal logics with two variables
We prove that the two-variable fragment of first-order intuitionistic logic is undecidable, even without constants and equality. We also show that the twovariable fragment of a quantified modal logic L with expanding first-order domains is undecidable whenever there is a Kripke frame for L with a point having infinitely many successors (such are, in particular, the first-order extensions of pra...
متن کاملOn Decidability of Intuitionistic Modal Logics
We prove a general decidability result for a class of intuitionistic modal logics. The proof is a slight modification of the Ganzinger, Meyer and Veanes [6] result on decidability of the two variable monadic guarded fragment of first order logic with constraints on the guard relations expressible in monadic second order logic.
متن کاملTruthful Monadic Abstractions
In intuitionistic sequent calculi, detecting that a sequent is unprovable is often used to direct proof search. This is for instance seen in backward chaining, where an unprovable subgoal means that the proof search must backtrack. In undecidable logics, however, proof search may continue indefinitely, finding neither a proof nor a disproof of a given subgoal. In this paper we characterize a fa...
متن کاملA general method for proving decidability of intuitionistic modal logics
We generalise the result of [H. Ganzinger, C. Meyer, M. Veanes, The two-variable guarded fragment with transitive relations, in: Proc. 14th IEEE Symposium on Logic in Computer Science, IEEE Computer Society Press, 1999, pp. 24–34] on decidability of the two variable monadic guarded fragment of first order logic with constraints on the guard relations expressible in monadic second order logic. I...
متن کامل